Performance of linear-space search algorithms
نویسندگان
چکیده
منابع مشابه
Artificial Intelligence Performance of linear - space search algorithms *
Search algorithms that use space linear in the search depth are widely employed in practice to solve difficult problems optimally, such as planning and scheduling. In this paper, we study the average-case performance of linear-space search algorithms, including depth-first branch-andbound (DFBnB), iterative-deepening (ID), and recursive best-first search (RBFS). To facilitate our analyses, we u...
متن کاملThe linear ordering problem: Instances, search space analysis and algorithms
The linear ordering problem is an NP-hard problem that arises in a variety of applications. Due to its interest in practice, it has received considerable attention and a variety of algorithmic approaches to its solution have been proposed. In this paper we give a detailed search space analysis of available LOP benchmark instance classes that have been used in various researches. The large fitne...
متن کاملAccuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery
Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...
متن کاملSearch Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
MAX-SAT is a well-known optimisation problem that can be seen as a generalisation of the propositional satisfiability problem. In this study, we investigate how the performance of stochastic local search (SLS) algorithms — a large and prominent class of algorithms that includes, for example, Tabu Search, Evolutionary Algorithms and Simulated Annealing — depends on features of the underlying sea...
متن کاملLinear-Space est-First Search: Summary of
Best-first search is a general search algorithm that, always expands next a frontier node of lowest cost. Its applicability, however, is limited by its exponential memory requirement. Iterative deepening, a previous approach to this problem, does not expand nodes in best-first, order if t’he cost, function can decrease along a path. We present a linear-space best-first search algorithm (RBFS) t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1995
ISSN: 0004-3702
DOI: 10.1016/0004-3702(94)00047-6